A localization algorithm using reliable anchor pair selection and Jaya algorithm for wireless sensor networks

In wireless sensor networks (WSNs) and large-scale IoT applications, node localization is a challenging process to identify the location of target or unknown nodes for accurate information transmission between nodes. Due their ease hardware implementation suitability WSNs, range-free techniques have been shown in previous studies. The existing algorithms did not consider anisotropy factors typically seen leading poor positioning accuracy. We proposed solution that combines benefits geometric constraint hop progress-based approaches address this issue. Each categorizes anchor pairs into one three categories, discriminating conditions are designed using provided by combination A algorithm determine position reduce effect anisotropic isotropic, O-shaped, S-shaped WSNs parameter-less Jaya (JA) method reliable pair (RAP) selection approach. case (AWSNs), finding more complicated. presented work compared with methods, including Distance Vector (DV)-maxHop, Particle Swarm Optimization (PSO), Quantized Salp Algorithm (QSSA) based algorithms. approach provides improved accuracy methods regarding number density. also looks at how degree irregularity computation time affect performance.